Solving flexible job-shop scheduling problem using harmony search-based meerkat clan algorithm

The classical job shop scheduling (JSS) problem can be extended by allowing processing of an operation any machine from a given set. This type is known as flexible (FJSS) problem. It incorporates all the difficulties and complexities its predecessor However, it more complex required to determine assignment operations machine. Swarm intelligence techniques proved their effectiveness in solving wide range NP-Hard real world problems. One these meerkat clan algorithm (MCA) that has been successfully applied various optimization paper presents modified MCA for FJSS modification based on using harmony search (HS). introduction HS provides exploitation intensification. generates solutions, which are provided MCA. As result, local optimum increased, turn increases convergence rate. experimental results show improved method achieves higher quality schedules. Additionally, rate speeded up compared with standalone algorithm. gives proposed superiority over original